On the decycling number of generalized Kautz digraphs
نویسندگان
چکیده
A set of vertices of a graph whose removal leaves an acyclic graph is called a decycling set of the graph. The minimum size of a decycling set of a graph G is referred to as the decycling number ofG. Let f(d, n) be the decycling number of the generalized Kautz digraph GK(d, n). In this paper, we obtain the upper bound of f(d, n) for all n ≥ d ≥ 2.
منابع مشابه
On the Domination Numbers of Generalized de Bruijn Digraphs and Generalized Kautz Digraphs
This work deals with the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs. Dominating sets for digraphs are not familiar compared with dominating sets for undirected graphs. Whereas dominating sets for digraphs have more applications than those for undirected graphs. We construct dominating sets of generalized de Bruijn digraphs where obtained dominating sets ...
متن کاملOn Cyclic Kautz Digraphs
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and out-degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphs MCK(d, `) and it is derived from the...
متن کاملThe Diameter of Cyclic Kautz Digraphs
A prominent problem in Graph Theory is to find extremal graphs or digraphs with restrictions in their diameter, degree and number of vertices. Here we obtain a new family of digraphs with minimal diameter, that is, given the number of vertices and degree there is no other digraph with a smaller diameter. This new family is called modified cyclic digraphsMCK(d, ) and it is derived from the Kautz...
متن کاملOn the number of cycles in generalized Kautz digraphs
In this paper, we count cycles in a generalized Kautz digraph GK (n; d). Let n = pd such that d| ,p. Also let gl = gcd(d − (−1)l; n). We show that if one of the following conditions holds: • p6 √ d7 d+1 and k6 logd n+ 1, • √ d7 d+1 ¡p¡d (d+ 1) and k6 logd ( n 3 √ p2(d+1) ) + 10 3 , • d(d+ 1)¡p and k6 logd ( n d+1 ) then the number of cycles of length k in GK (n; d) is given by 1 k ∑ l | k ( k l...
متن کاملIsomorphic factorization, the Kronecker product and the line digraph
In this paper, we investigate isomorphic factorizations of the Kronecker product graphs. Using these relations, it is shown that (1) the Kronecker product of the d-out-regular digraph and the complete symmetric digraph is factorized into the line digraph, (2) the Kronecker product of the Kautz digraph and the de Bruijn digraph is factorized into the Kautz digraph, (3) the Kronecker product of b...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Inf. Process. Lett.
دوره 115 شماره
صفحات -
تاریخ انتشار 2015